Constrained versions of Sauer's lemma

نویسنده

  • Joel Ratsaby
چکیده

Let [n] = {1, . . . , n}. For a function h : [n] → {0, 1}, x ∈ [n] and y ∈ {0, 1} define by the width ωh(x, y) of h at x the largest non-negative integer a such that h(z) = y on x− a ≤ z ≤ x+ a. We consider finite VC-dimension classes of functions h constrained to have a width ωh(xi, yi) which is larger than N for all points in a sample ζ = {(xi, yi)}1 or a width no larger than N over the whole domain [n]. Extending Sauer’s lemma, a tight upper bound with closed-form estimates is obtained on the cardinality of several such classes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the hardness of the shortest vector problem

An n-dimensional lattice is the set of all integral linear combinations of n linearly independent vectors in ' tm. One of the most studied algorithmic problems on lattices is the shortest vector problem (SVP): given a lattice, find the shortest non-zero vector in it. We prove that the shortest vector problem is NP-hard (for randomized reductions) to approximate within some constant factor great...

متن کامل

VC-Dimension of Sets of Permutations

We deene the VC-dimension of a set of permutations A S n to be the maximal k such that there exist distinct i 1 ; :::; i k 2 f1; :::; ng that appear in A in all possible linear orders, that is, every linear order of fi 1 ; :::; i k g is equivalent to the standard order of f(i 1); :::; (i k)g for at least one permutation 2 A. In other words, the VC-dimension of A is the maximal k such that for s...

متن کامل

Multilabeled versions of Sperner's and Fan's lemmas and applications

We propose a general technique related to the polytopal Sperner lemma for proving old and new multilabeled versions of Sperner’s lemma. A notable application of this technique yields a cake-cutting theorem where the number of players and the number of pieces can be independently chosen. We also prove multilabeled versions of Fan’s lemma, a combinatorial analogue of the Borsuk-Ulam theorem, and ...

متن کامل

Improved algorithmic versions of the Lovász Local Lemma

The Lovász Local Lemma is a powerful tool in combinatorics and computer science. The original version of the lemma was nonconstructive, and efficient algorithmic versions have been developed by Beck, Alon, Molloy & Reed, et al. In particular, the work of Molloy & Reed lets us automatically extract efficient versions of essentially any application of the symmetric version of the Local Lemma. How...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Generalized KYP Lemma: Unified Characterization of Frequency Domain Inequalities with Applications to System Design

The cerebrated Kalman-Yakubovic̆-Popov (KYP) lemma establishes the equivalence between a frequency domain inequality (FDI) and a linear matrix inequality (LMI), and has played one of the most fundamental roles in systems and control theory. This paper generalizes the KYP lemma in two aspects — the frequency range and the class of systems — and unifies various existing versions by a single theore...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 156  شماره 

صفحات  -

تاریخ انتشار 2008